Enhanced graph rewriting systems for complex software domains
نویسندگان
چکیده
منابع مشابه
Enhanced Graph Rewriting Systems for Complex Software Domains (SoSyM Abstract)
Methodologies for correct by construction reconfigurations can efficiently solve consistency issues in dynamic software architecture. Graph-based models are appropriate for designing such architectures and methods. At the same time, they may be unfit to characterize a system from a non functional perspective. This stems from efficiency and applicability limitations in handling time-varying char...
متن کاملEnhanced Graph Rewriting Systems for Performance Aware Dynamic Software Architectures
Methodologies for correct by construction reconfigurations can efficiently solve consistency issues in dynamic software architectures. At the same time, they may be unfit to characterize a system from a performance perspective. This stems from efficiency and applicability limitations in handling time-varying characteristics and related intradependencies. In order to lift these restrictions, an ...
متن کاملPORGY: A Visual Graph Rewriting Environment for Complex Systems
Graph rewriting systems (GRSs) operate on graphs by substituting local patterns according to a set of rewriting rules. The apparent simplicity of GRSs hides an incredible complexity and turns the study of these systems into an involved task requiring high-level expertise. We designed PORGY, an interactive visual environment to fully support GRSs related tasks, exploiting a long historical tradi...
متن کاملModelling Constrained Dynamic Software Architecture with Attributed Graph Rewriting Systems
Dynamic software architectures are studied for handling adaptation in distributed systems, coping with new requirements, new environments, and failures. Graph rewriting systems have shown their appropriateness to model such architectures, particularly while considering the consistency of theirs reconfigurations. They provide generic formal means to specify structural properties, but imply a poo...
متن کاملBlind graph rewriting systems
We consider a simple (probably, the simplest) structure for random access memory. This structure can be used to construct a universal system with nearly void processor, namely, we demonstrate that the processor of such a system may have empty instruction set, in a more strong manner than the existing ZISC (zero instruction set computer based on ideas for artificial neural networks) and NISC arc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Software & Systems Modeling
سال: 2014
ISSN: 1619-1366,1619-1374
DOI: 10.1007/s10270-014-0433-1